Approximate Schreier decorations and approximate Kőnig’s line coloring Theorem
نویسندگان
چکیده
Following recent result of L. M. Tóth [Tót21, Annales Henri Lebesgue, Volume 4 (2021)] we show that every 2Δ-regular Borel graph
منابع مشابه
Approximate coloring of uniform
We consider an algorithmic problem of coloring r-uniform hypergraphs. The problem of nding the exact value of the chromatic number of a hypergraph is known to be NP -hard, so we discuss approximate solutions to it. Using a simple construction and known results on hardness of graph coloring, we show that for any r 3 it is impossible to approximate in polynomial time the chromatic number of r-uni...
متن کاملParameterized (Approximate) Defective Coloring
In Defective Coloring we are given a graph G = (V,E) and two integers χd,∆ and are asked if we can partition V into χd color classes, so that each class induces a graph of maximum degree ∆∗. We investigate the complexity of this generalization of Coloring with respect to several well-studied graph parameters, and show that the problem is W-hard parameterized by treewidth, pathwidth, tree-depth,...
متن کاملHardness of Approximate Coloring
The graph coloring problem is a notoriously hard problem, for which we do not have efficient algorithms. A coloring of a graph is an assignment of colors to its vertices such that the end points of every edge have different colors. A k-coloring is a coloring that uses at most k distinct colors. The graph coloring problem is to find a coloring that uses the minimum number of colors. Given a 3-co...
متن کاملApproximate Hypergraph Coloring
A coloring of a hypergraph is a mapping of vertices to colors such that no hyperedge is monochromatic. We are interested in the problem of coloring 2-colorable hypergraphs. For the special case of graphs (hypergraphs of dimension 2) this can easily be done in linear time. The problem for general hypergraphs is much more difficult since a result of Lovász implies that the problem is NP-hard even...
متن کاملApproximate Constrained Bipartite Edge Coloring
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Henri Lebesgue
سال: 2022
ISSN: ['2644-9463']
DOI: https://doi.org/10.5802/ahl.124